Vanishing components in autonomous competitive Lotka–Volterra systems
نویسندگان
چکیده
منابع مشابه
Competitive Strategies for Autonomous Systems
A strategy for working with incomplete information is called competitive if it solves each problem instance at a cost not exceeding the cost of an optimal solution (with full information available), times a constant. This paper strives to demonstrate why competitive strategies are useful for the design of autonomous robots. They guarantee a good worst-case behaviour, they are easy to implement,...
متن کاملCompetitive Learning in Autonomous
A BSTRACT Artificial Neural Network (ANN) algorithms provide powerful techniques for the construction of computing systems which are capable of adapting to non-stationary or incompletely specified operating environments. Unsupervised learning is of particular interest in such situations. This paper reports the results of empirical studies into the characteristics of standard and soft competitiv...
متن کاملGlobal Attractor in Autonomous Competitive Lotka-volterra Systems
For autonomous Lotka-Volterra systems modelling the dynamics of N competing species, a new condition has been found to prevent a particular species from dying out. Based on this condition, criteria have been established for all or some of the N species to stabilise at a steady state whilst the others, if any, die out.
متن کاملDiagnosability Analysis of Discrete Event Systems with Autonomous Components
Diagnosability is the property of a given partially observable system model to always exhibit unambiguously a failure behavior from its only available observations in finite time after the fault occurrence, which is the basic question that underlies diagnosis taking into account its requirements at design stage. However, for the sake of simplicity, the previous works on diagnosability analysis ...
متن کاملPrincipal Components Analysis Competitive Learning
We present a new neural model that extends the classical competitive learning by performing a principal components analysis (PCA) at each neuron. This model represents an improvement with respect to known local PCA methods, because it is not needed to present the entire data set to the network on each computing step. This allows a fast execution while retaining the dimensionality-reduction prop...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 2009
ISSN: 0022-247X
DOI: 10.1016/j.jmaa.2009.05.054